Global Heuristics for Distributed Cooperative Multi-Agent Planning
نویسندگان
چکیده
Almost every planner needs good heuristics to be efficient. Heuristic planning has experienced an impressive progress over the last years thanks to the emergence of more and more powerful estimators. However, this progress has not been translated to multi-agent planning (MAP) due to the difficulty of applying classical heuristics in distributed environments. The application of local search heuristics in each agent has been the most widely adopted approach in MAP but there exist some recent attempts to use global heuristics. In this paper we show that the success of global heuristics in MAP depends on a proper selection of heuristics for a distributed environment as well as on their adequate combination.
منابع مشابه
Team-Work based Architecture for Distributed Manufacturing Scheduling
This paper presents a Team-Work based architecture for Distributed Manufacturing Scheduling with Genetic Algorithms and Tabu Search. We consider that a good global solution for a scheduling problem may emerge from a community of machine agents solving locally their schedules and cooperating with other machine agents. Social aspects are considered when a community of autonomous agents cooperate ...
متن کاملAdmissible Landmark Heuristic for Multi-Agent Planning
Heuristics are a crucial component in modern planning systems. In optimal multiagent planning the state of the art is to compute the heuristic locally using only information available to a single agent. This approach has a major deficiency as the local shortest path can arbitrarily underestimate the true shortest path cost in the global problem. As a solution, we propose a distributed version o...
متن کاملPhotovoltaic Microgrids Control by the Cooperative Control of Multi-Agent Systems
This paper presents a cooperative control which is applied to the secondary control of a microgrid controlled via a multi-agent scheme. Balancing power that leads to voltage and frequency stability in a microgrid is essential. The voltage and frequency regulations are limiting within the specified limits and conveying them to their nominal values. Limiting and conveying the voltage and frequenc...
متن کاملGeneralizing the Partial Global Planning Algorithm
The distributed coordination problem can be described as how should the local scheduling of activities at each agent be affected by non-local concerns and constraints. Partial global planning (PGP) is a flexible approach to distributed coordination that allows agents to respond dynamically to their current situation. It is based on detecting relationships in the computational goal structures of...
متن کاملPotential Heuristics for Multi-Agent Planning
Distributed heuristic search is a well established technique for multi-agent planning. It has been shown that distributed heuristics may crucially improve the search guidance, but are costly in terms of communication and computation time. One solution is to compute a heuristic additively, in the sense that each agent can compute its part of the heuristic independently and obtain a complete heur...
متن کامل